Open Problem—Size-Based Scheduling with Estimation Errors
نویسندگان
چکیده
منابع مشابه
Impact of Qualitative and Quantitative errors of the job runtime estimation in backfilling based scheduling policies
Estimation or prediction accuracy in backfilling based policies it’s an important issue that has high impact on the system performance. However it’s not clear which is the required precision of such estimations, moreover it’s not clear which kind of errors are critical when scheduling the jobs that are queued in the local systems. In this paper we present a deeper analysis of the impact of the ...
متن کاملEstimation in Nonparametric Regression with Nonregular Errors
For sufficiently nonregular distributions with bounded support, the extreme observations converge to the boundary points at a faster rate than the square root of the sample size. In a nonparametric regression model with such a nonregular error distribution, this fact can be used to construct an estimator for the regression function that converges at a faster rate than the Nadaraya– Watson estim...
متن کاملCoping with dating errors in causality estimation
We consider the problem of estimating causal influences between observed processes from time series possibly corrupted by errors in the time variable (dating errors) which are typical in palaeoclimatology, planetary science and astrophysics. “Causality ratio” based on the WienerGranger causality is proposed and studied for a paradigmatic class of model systems to reveal conditions under which i...
متن کاملA Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...
متن کاملA Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Systems
سال: 2019
ISSN: 1946-5238,1946-5238
DOI: 10.1287/stsy.2019.0041